Capacity of Byzantine Agreement
نویسندگان
چکیده
Caveat: This report represents work-in-progress, and provides some of our early results on the topic. A more complete version of this report, with additional results not presented in this draft, and improved description of the algorithms and analysis, will be released later this year. This draft version contains known problems with clarity/readability and the descriptions are incomplete/imprecise in some places. The draft is being released nevertheless to seek early feedback from other researchers.
منابع مشابه
Capacity of Agreement with Finite Link Capacity
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical problem in distributed computing, with initial solutions presented in the seminal work of Pease, Shostak and Lamport. In existing literature, the communication links are implicitly assumed to have infinite capacity. The pro...
متن کاملCapacity of Byzantine Agreement: Tight Bound for the Four Node Network
In this report, we consider the problem of maximizing the throughput of Byzantine agreement. Byzantine agreement is a classical problem in distributed computing, with initial solutions presented in the seminal work of Pease, Shostak and Lamport [1, 2]. There has also been more recent work on designing multicast algorithms that can survive Byzantine attacks (e.g., [3]). Many variations on the By...
متن کاملCapacity of Byzantine Agreement: Complete Characterization of Four-Node Networks
Any opinions, findings, and conclusions or recommendations expressed here are those of the authors and do not necessarily reflect the views of the funding agencies or the U.S. government.
متن کاملA Comparison of the Byzantine Agreement Problem and the Transaction Commit Problem
Transaction commit and Byzantine agreement solve the problem of multiple processes reaching agreement in the presence of process and message failures. This paper summarizes the computation and fault models of the two kinds of agreement and shows the difference between them. In particular, it explains that Byzantine agreement is rarely used in practice because it involves significantly more hard...
متن کاملByzantine Preferential Voting
In the Byzantine agreement problem, n nodes with possibly different input values aim to reach agreement on a common value in the presence of t < n/3 Byzantine nodes which represent arbitrary failures in the system. This paper introduces a generalization of Byzantine agreement, where the input values of the nodes are preference rankings of three or more candidates. We show that consensus on pref...
متن کامل